Translational polygon containment
نویسندگان
چکیده
In this paper we present a natural and simple procedure to compute all feasible allocation points of a (non-convex) polygon within a (non-convex) polygonal bounded region. This procedure can be seen as a basis of more sophisticated and efficient algorithms for the same task, or for related problems such as finding a single placement point.
منابع مشابه
Translational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming Translational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming
We present an algorithm for the two-dimensional translational containment problem: nd translations for k polygons (with up to m vertices each) which place them inside a polygonal container (with n vertices) without overlapping. The polygons and container may be nonconvex. The containment algorithm consists of new algorithms for restriction, evaluation, and subdivision of two-dimensional conngur...
متن کاملDistance-based Subdivision for Translational LP Containment
The two-dimensional translational containment problem is to nd translations for a collection of polygons which place them inside a polygonal container without overlapping. The polygons and container may be nonconvex. Our linear-programming-based (LP) translational containment algorithm uses our re-strict/evaluate/subdivide paradigm which operates on two-dimensional connguration spaces. The foll...
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Mathematical Programming
We present a new algorithm for the two-dimensional translational containment problem: nd translations for k polygons which place them inside a polygonal container without overlapping. Both the polygons and the container can be nonconvex. The algorithm is based on mathematical programming principles. We generalize our containment approach to solve minimal enclosure problems. We give algorithms t...
متن کاملThe Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon
We present a diagram that captures containment information for scalable rotated and translated versions of a convex polygon. For a given polygon P and a contact point q in a point set S, the diagram parameterizes possible translations, rotations, and scales of the polygon in order to represent containment regions for each additional point v in S. We present geometric and combinatorial propertie...
متن کاملThe Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon
We present a diagram that captures containment information for scalable translations of a convex polygon. For a given polygon P and contact point q in a set S, the diagram parameterizes possible translations and scales of the polygon in order to represent containment regions for each other point v in S. We present geometric and combinatorial properties for this diagram, and describe how it can ...
متن کامل